Leader Election Algorithm in 3D Torus Networks with the Presence of One Link Failure
نویسندگان
چکیده
Leader election is the process of choosing a leader for symmetry breaking where each node in the network eventually decides whether it is a leader or not. This paper proposes a new leader election algorithm to solve the problem of leader failure in three dimensional torus networks. The proposed algorithm solves the election problem despite the existent of link failure. In a network of N nodes connected by three dimensional torus network, the new algorithm needs O(N) messages to elect a new leader in 3 N O time steps. These results are valid for two cases: the simple case where the leader failure is detected by one node, and the worst case where the failure is discovered by N-1 nodes. KeywordsConcurrency; Leader Election; Link Failure; leader failure; 3D Torus Networks.
منابع مشابه
Leader Election Algorithm in 2D Torus Networks with the Presence of One Link Failure
Leader election algorithms solve the instability problem in the network which is caused by leader failure .In this paper, we propose a new leader election algorithm in two dimensional torus networks. The algorithm aims to elect one node to be a new leader. The new leader is identified by some characteristics not in the other nodes in the network. When the process is terminated, the network is r...
متن کاملLeader Election Algorithms in Torus and Hypercube Networks Comparisons and Survey
Leader failure is one of the most fundamental problems in distributed systems. This problem can be solved by Leader Election Algorithms (LEAs). These algorithms move the system from an initial state where all the nodes are in the same computation state into a new state where only one node is distinguished computationally (called leader) and all other nodes aware of this leader. This research ai...
متن کاملLeader Election Algorithm in Hypercubes with the Presence
Leader Election is a fundamental problem in centralized control of distributed systems. The election process starts when one or more processors discover that the leader has failed, and it terminates when the remaining processors know who the new leader is. This study presents a distributed solution to this problem in Hypercube networks considering the link failure. A distributed leader election...
متن کاملAn Election Algorithm to Ensure the High Availability of Leader in Large Mobile Ad Hoc Networks∗
A fundamental problem of distributed systems, leader election, is presented in the context of mobile ad hoc networks (MANETs). In many distributed systems, the presence of a leader is necessary in order to monitor underlying computations, guarantee quality functioning, take checkpoints, generate the lost token, detect quiescence conditions, etc. Hence, several leader election algorithms have be...
متن کاملA Modified Leader Election Algorithm for MANET
Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network ...
متن کامل